Bounded Linear Logic, Revisited
نویسندگان
چکیده
منابع مشابه
Bounded Linear Logic, Revisited
We present QBAL, an extension of Girard, Scedrov and Scott’s bounded linear logic. The main novelty of the system is the possibility of quantifying over resource variables. This generalization makes bounded linear logic considerably more flexible, while preserving soundness and completeness for polynomial time. In particular, we provide compositional embeddings of Leivant’s RRW and Hofmann’s LF...
متن کاملBounded Linear Logic
A typed, modular paradigm for polynomial time computation is proposed. Comments University of Pennsylvania Department of Computer and Information Sciences Technical Report No. MSCIS-91-59. This technical report is available at ScholarlyCommons: http://repository.upenn.edu/cis_reports/338 Bounded Linear Logic: A Modular Approach to Polynomial Time Computability MS-CIS-91-59 LOGIC & COMPUTATION 3...
متن کاملINTUITIONISTIC FUZZY BOUNDED LINEAR OPERATORS
The object of this paper is to introduce the notion of intuitionisticfuzzy continuous mappings and intuitionistic fuzzy bounded linear operatorsfrom one intuitionistic fuzzy n-normed linear space to another. Relation betweenintuitionistic fuzzy continuity and intuitionistic fuzzy bounded linearoperators are studied and some interesting results are obtained.
متن کاملSOLVING FUZZY LINEAR PROGRAMMING PROBLEMS WITH LINEAR MEMBERSHIP FUNCTIONS-REVISITED
Recently, Gasimov and Yenilmez proposed an approach for solving two kinds of fuzzy linear programming (FLP) problems. Through the approach, each FLP problem is first defuzzified into an equivalent crisp problem which is non-linear and even non-convex. Then, the crisp problem is solved by the use of the modified subgradient method. In this paper we will have another look at the earlier defuzzifi...
متن کاملLinear logic by levels and bounded time complexity
This work deals with the characterization of elementary and deterministic polynomial time computation in linear logic through the proofs-asprograms correspondence. Girard’s seminal results, concerning elementary and light linear logic, use a principle called stratification to ensure the complexity bound on the cut-elimination procedure. Here, we propose a more flexible control principle, that o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2010
ISSN: 1860-5974
DOI: 10.2168/lmcs-6(4:7)2010